An institution theory of formal meta-modelling in graphically extended BNF

Meta-modelling plays an important role in model driven software development.In this paper,a graphic extension of BNF (GEBNF) is proposed to define the abstract syntax of graphic modelling languages.Fro...     

基于本体的主动元数据挖掘系统研究

传统网上信息检索是用户被动地依靠浏览超级链接网页而获取的。文中提出基于本体的主动元数据挖掘系统以及在果品领域的应用,在主动搜索、元数据生成、借助本体作用于数据的语义描述等方面,其效果是客观的。使得对信息数据的搜索从被动地获取到主动依靠计算机自动搜索;从依靠关键字作为查询依据到借助本体的作用获取语义描述的信息数据,进而提高了信息查询效率及查询的准确率,这也是当前信息检索研究的热门课题。实验证明,通过主动元数据挖掘实例可以实现语义的扩充,如同义、近义及上下位关系。同时也验证了本体对实施语义智能检索所带来的客观效果。     

The interprocedural analysis and automatic parallelization of Scheme programs

Lisp and its descendants are among the most important and widely used of programming languages. At the same time, parallelism in the architecture of computer systems is becoming commonplace. There is a pressing need to extend the technology of automatic parallelization that has become available to Fortran programmers of parallel machines, to the realm of Lisp programs and symbolic computing. In this paper we present a comprehensive approach to the compilation of Scheme programs for shared-memory multiprocessors. Our strategy has two principal components:interprocedural analysis andprogram restructuring. We introduceprocedure strings andstack configurations as a framework in which to reason about interprocedural side-effects and object lifetimes, and develop a system of interprocedural analysis, using abstract interpretation, that is used in the dependence analysis and memory management of Scheme programs. We introduce the transformations ofexit-loop translation andrecursion splitting to treat the control structures of iteration and recursion that arise commonly in Scheme programs. We propose an alternative representation for s-expressions that facilitates the parallel creation and access of lists. We have implemented these ideas in a parallelizing Scheme compiler and run-time system, and we complement the theory of our work with snapshots of programs during the restructuring process, and some preliminary performance results of the execution of object codes produced by the compiler.This work was supported in part by the National Science Foundation under Grant No. NSF MIP-8410110, the U.S. Department of Energy under Grant No. DE-FG02-85ER25001, the Office of Naval Research under Grant No. ONR N00014-88-K-0686, the U.S. Air Force Office of Scientific Research under Grant No. AFOSR-F49620-86-C-0136, and by a donation from the IBM Corportation.     

Semantic analysis in XTRA,an English — Chinese machine translation system

This paper concerns the resolution of lexical ambiguity in a machine translation environment. We describe the integration of principles of selection restrictions. Preference Semantics, and intelligent relaxation of constraints in handling lexical ambiguity. The approach differs from many previous MT systems in that it is more powerful than brute force systems, while more realistic than systems that assume a large degree of coded encyclopedia information for full understanding.     

基于内容的静态语义概念视频检索方法研究

本文针对互联网视频检索技术的发展,阐述了目前主流视频搜索引擎的技术现状,分析了互联网视频检索的关键技术,特别是对于视频特征的提取技术。本文的创新点是提出了一种通用的基于内容的静态语义视频检索方法,该方法可以弥补基于文本视频检索的有关不足,并且在TRECVID的视频概念检索数据的静态语义概念中得到验证,运行稳定。     

基于多层次语义特征的建筑立面点云提取方法

建筑立面信息是指建筑物与外部空间接触面的空间分布及属性信息,如何从点云数据中提取建筑立面信息是点云数据处理中的热点和难点。为解决传统格网密度算法在建筑立面点云提取时评价标准单一、适应性不强的问题,综合分析建筑区各类典型地物点云的高程分布、投影密度、法向量分布等局部及整体空间特征,构建由点云单点语义、格网语义及区域语义组成的多层次语义特征描述子,在此基础上提出一种建筑立面点云提取方法,针对建筑立面点云在不同层次语义上的特点设置合理阈值,通过逐层筛选实现建筑立面点云的精确提取。试验结果表明：该算法能在低层、高层以及超高层建筑区等不同场景海量点云中快速准确地实现建筑立面点云提取,算法精度、效率、适应性良好。     

FracSym: Automated symbolic computation of Lie symmetries of fractional differential equations

In this paper, we present an algorithm for the systematic calculation of Lie point symmetries for fractional order differential equations (FDEs) using the method as described by Buckwar & Luchko (1998) and Gazizov, Kasatkin & Lukashchuk (2007, 2009, 2011). The method has been generalised here to allow for the determination of symmetries for FDEs with n$n$ independent variables and for systems of partial FDEs. The algorithm has been implemented in the new MAPLE package FracSym (Jefferson and Carminati 2013) which uses routines from the MAPLE symmetry packages DESOLVII (Vu, Jefferson and Carminati, 2012) and ASP (Jefferson and Carminati, 2013). We introduce FracSym by investigating the symmetries of a number of FDEs; specific forms of any arbitrary functions, which may extend the symmetry algebras, are also determined. For each of the FDEs discussed, selected invariant solutions are then presented.     

A weighted multivariate Fuzzy C-Means method in interval-valued scientific production data

Clustering is the process of organizing objects into groups whose members are similar in some way. Most of the clustering methods involve numeric data only. However, this representation may not be adequate to model complex information which may be: histogram, distributions, intervals. To deal with these types of data, Symbolic Data Analysis (SDA) was developed. In multivariate data analysis, it is common some variables be more or less relevant than others and less relevant variables can mask the cluster structure. This work proposes a clustering method based on fuzzy approach that produces weighted multivariate memberships for interval-valued data. These memberships can change at each iteration of the algorithm and they are different from one variable to another and from one cluster to another. Furthermore, there is a different relevance weight associated to each variable that may also be different from one cluster to another. The advantage of this method is that it is robust to ambiguous cluster membership assignment since weights represent how important the different variables are to the clusters. Experiments are performed with synthetic data sets to compare the performance of the proposed method against other methods already established by the clustering literature. Also, an application with interval-valued scientific production data is presented in this work. Clustering quality results have shown that the proposed method offers higher accuracy when variables have different variabilities.     

公式分层的谓词模态逻辑

由于必然模态词□的引入,谓词模态逻辑的公式在一个可能世界中的真假值可能依赖于其可达的可能世界.在谓词模态逻辑中存在个体跨可能世界相等问题.针对这一问题,Lewis提出了对应物理论,并且在对应物理论中用对应物关系来表示个体跨可能世界相等.但是,当一个对象具有一个以上的对应物时,谓词模态逻辑中的跨可能世界相等关系无法与对应物关系建立一一对应.通过限制谓词模态逻辑中全称量词∀的范围,给出了一种公式分层的谓词模态逻辑.它是谓词模态逻辑的一个子逻辑,并且其语言与谓词模态逻辑的语言是相同的.但其公式是分层定义的,使得∀可以出现在□的范围内,并且□不能出现在∀的范围内.由于任意形如∀x□φ（x）的表达式都不是该逻辑的公式,以量词开头的公式在一个可能世界w中的真假值只依赖于w,该逻辑避免了个体跨可能世界相等问题.给出了该逻辑的语言、语法和语义,并证明了该逻辑是可靠的和完备的.     

基于Mining-SEC方法的电路等价性验证

针对时序电路的等价性验证难题,提出基于Mining-SEC的定界等价性验证方法。将待验证时序电路按时间帧展开为多项式符号代数表示的电路集合,利用时间序列数据挖掘方法挖掘其中的不变量和相应的全局约束,不变量可以是任意多项式。此外还可挖掘电路中的不合法约束和复杂的多项式关系,通过以上方法可以明显降低求解空间。使用基于SMT的验证引擎检验电路等价性。实验结果表明,该方法可以快速地实现验证收敛,得到平均1~2个量级的验证加速,并且可以有效消除虚假验证。